By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 3, Issue 4, pp. 669-918

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Convex Functions with Unbounded Level Sets and Applications to Duality Theory

A. Auslender, R. Cominetti, and J. P. Crouziex

pp. 669-687

BibTeX  Abstract Full Text:  PDF

Reducing Matching to Polynomial Size Linear Programming

Francisco Barahona

pp. 688-695

BibTeX  Abstract Full Text:  PDF

Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives

Tamra J. Carpenter, Irvin J. Lusting, John M. Mulvey, and David F. Shanno

pp. 696-725

BibTeX  Abstract Full Text:  PDF

A Note on $K$-Best Solutions to the Chinese Postman Problem

Yasufumi Saruwatari and Tomomi Matsui

pp. 726-733

BibTeX  Abstract Full Text:  PDF

Generating Fenchel Cutting Planes for Knapsack Polyhedra

E. A. Boyd

pp. 734-750

BibTeX  Abstract Full Text:  PDF

Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming

Ciyou Zhu and R. T. Rockafellar

pp. 751-783

BibTeX  Abstract Full Text:  PDF

The $D_2^* $-Triangulation for Continuous Deformation Algorithms to Compute Solutions of Nonlinear Equations

Chuangyin Dang

pp. 784-799

BibTeX  Abstract Full Text:  PDF

$\alpha $-Lower Subdifferentiable Functions

J. E. Martínez-Legaz and S. Romano-Rodríguez

pp. 800-825

BibTeX  Abstract Full Text:  PDF

A Global Optimization Algorithm for Concave Quadratic Programming Problems

Immanuel M. Bomze and Gabriele Danninger

pp. 826-842

BibTeX  Abstract Full Text:  PDF

A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems

Florian Potra and Yinyu Ye

pp. 843-860

BibTeX  Abstract Full Text:  PDF

On Mizuno's Rank-One Updating Algorithm for Linear Programming

Robert A. Bosch

pp. 861-867

BibTeX  Abstract Full Text:  PDF

Accelerated Stochastic Approximation

Bernard Delyon and Anatoli Juditsky

pp. 868-881

BibTeX  Abstract Full Text:  PDF

Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem

Ubaldo Garcoa-Palomares

pp. 882-900

BibTeX  Abstract Full Text:  PDF

A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems

K. O. Kortanek and Hoon No

pp. 901-918

BibTeX  Abstract Full Text:  PDF